Calcul D'un Ordonnancement Faisable Sous Un Ensemble De Contraintes Cycliques Computing a Feasible Schedule under a Set of Cyclic Constraints
نویسنده
چکیده
SOUS UN ENSEMBLE DE CONTRAINTES CYCLIQUES COMPUTING A FEASIBLE SCHEDULE UNDER A SET OF CYCLIC CONSTRAINTS St ephane Julia , Robert Valette , Maurizio Tazza LAAS-CNRS, 7 Avenue du Colonel-Roche, 31077 Toulouse Cedex France CPGEI-CEFET-PR, Av. Sete de Setembro 3165, 80.230-901 Curitiba (PR) Brasil email [email protected] [email protected] R esum e L'approche pr esent ee dans cet article est bas ee sur des r eseaux de Petri temporis es avec des dur ees associ ees aux places (attente et marge) et aux transitions (temps op eratoires). La programmation math ematique est utilis ee pour calculer des bornes minimales et maximales pour les temps d'attente et un algorithme bas e sur le joueur pour calculer un ordonnancement faisable. Abstract The approach presented in this paper is based on a timed Petri net with durations attached to places (wait and slack times) and to transitions (operation times). Linear programming is used to compute minimal and maximal bounds to the wait times and a token player algorithm to compute a feasible schedule.
منابع مشابه
Some Eecient Solutions to the Aane Scheduling Problem Part I One-dimensional Time
Programs and systems of recurrence equations may be represented as sets of actions which are to be executed subject to precedence constraints. In many cases, actions may be labelled by integral vectors in some iteration domain, and precedence constraints may be described by aane relations. A schedule for such a program is a function which assigns an execution date to each action. Knowledge of s...
متن کاملBudget Constrained Resource Allocation for Non-Deterministic Workflows on a IaaS Cloud
Many scienti c applications are described through work ow structures. Due to the increasing level of parallelism o ered by modern computing infrastructures, work ow applications now have to be composed not only of sequential programs, but also of parallel ones. Cloud platforms bring on-demand resource provisioning and pay-as-you-go payment charging. Then the execution of a work ow corresponds t...
متن کاملBudget Constrained Resource Allocation for Non-deterministic Workflows on an IaaS Cloud
Many scienti c applications are described through work ow structures. Due to the increasing level of parallelism o ered by modern computing infrastructures, work ow applications now have to be composed not only of sequential programs, but also of parallel ones. Cloud platforms bring on-demand resource provisioning and pay-as-you-go payment charging. Then the execution of a work ow corresponds t...
متن کاملOrdonnancement sous contraintes de qualité de service dans les clouds. (Cloud scheduling under quality of service constraints)
متن کامل
Dynamic Scheduling of MapReduce Shuffle under Bandwidth Constraints
Whether it is for e-science or business, the amount of data produced every year is growing at a high rate. Managing and processing those data raises new challenges. MapReduce is one answer to the need for scalable tools able to handle the amount of data. It imposes a general structure of computation and let the implementation perform its optimizations. During the computation, there is a phase c...
متن کامل